On the Complexity of Propositional Quantification in Intuitionistic Logic
نویسنده
چکیده
We define a propositionally quantified intuitionistic logic Her+ by a natural extension of Kripke's semantics for propositional intuitionistic logic. We then show that Har+ is recursively isomorphic to full second order classical logic. Her+ is the intuitionistic analogue of the modal systems S57r+, S47r+, S4.27r+, K47r+, Tir+, K7r+ and Bir+, studied by Fine. ?
منابع مشابه
Truth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملAn Ac-complete Model Checking Problem for Intuitionistic Logic∗
We show that the model checking problem for intuitionistic propositional logic with one variable is complete for logspace-uniform AC1. The basic tool we use is the connection between intuitionistic logic and Heyting algebras, investigating its complexity theoretical aspects. For superintuitionistic logics with one variable, we obtain NC1-completeness for the model checking problem.
متن کاملThe model checking problem for intuitionistic propositional logic with one variable is AC1-complete
We show that the model checking problem for intuitionistic propositional logic with one variable is complete for logspace-uniform AC. As basic tool we use the connection between intuitionistic logic and Heyting algebra, and investigate its complexity theoretical aspects. For superintuitionistic logics with one variable, we obtain NC-completeness for the model checking problem.
متن کاملProof complexity of intuitionistic implicational formulas
We study implicational formulas in the context of proof complexity of intuitionistic propositional logic (IPC). On the one hand, we give an efficient transformation of tautologies to implicational tautologies that preserves the lengths of intuitionistic extended Frege (EF ) or substitution Frege (SF ) proofs up to a polynomial. On the other hand, EF proofs in the implicational fragment of IPC p...
متن کاملOn the computational content of intuitionistic propositional proofs
The intuitionistic calculus was introduced to capture reasoning in constructive mathematics. As such it has much more constructive character than classical logic. This property of the intuitionistic calculus has been extensively studied, but mostly from the point of view of computability and little has been proved about computational complexity. The aim of this paper is to show that the constru...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Log.
دوره 62 شماره
صفحات -
تاریخ انتشار 1997